Z2-algebras in the Boolean function irreducible decomposition
نویسندگان
چکیده
منابع مشابه
Irreducible Decomposition for Tensor Product Representations of Jordanian Quantum Algebras
Tensor products of irreducible representations of the Jordanian quantum algebras Uh(sl(2)) and Uh(su(1, 1)) are considered. For both the highest weight finite dimensional representations of Uh(sl(2)) and lowest weight infinite dimensional ones of Uh(su(1, 1)) , it is shown that tensor product representations are reducible and that the decomposition rules to irreducible representations are exact...
متن کاملIrreducible Boolean Functions
This paper is a contribution to the study of a quasi-order on the set Ω of Boolean functions, the simple minor quasi-order. We look at the join-irreducible members of the resulting poset˜Ω. Using a two-way correspondence between Boolean functions and hypergraphs, join-irreducibility translates into a combinatorial property of hypergraphs. We observe that among Steiner systems, those which yield...
متن کاملJoin-Irreducible Boolean Functions
This paper is a contribution to the study of a quasi-order on the set Ω of Boolean functions, the simple minor quasi-order. We look at the join-irreducible members of the resulting poset Ω̃. Using a two-way correspondence between Boolean functions and hypergraphs, join-irreducibility translates into a combinatorial property of hypergraphs. We observe that among Steiner systems, those which yield...
متن کاملDecomposition of Boolean Function Sets for Boolean Neural Networks
This paper presents a new type of neuron, called Boolean neuron. We suggest algorithms for decomposition of Boolean functions sets based on Boolean neural networks that include only Boolean neurons. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural networks. The Boolean n...
متن کاملCovers: A Theory of Boolean Function Decomposition
In this paper, we develop a theory of covers for funct ions defined over boolean str ings. Given a function , a cover is a decomposition , though not necessarily a partition, of the bits into subproblems that can be solved in parallel. In the paper , we formulat e th e notion of cover size , which equals the size of the largest subproblem in a decomposition for a parti cular function. Cover siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2012
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.3685444